Binary shifts of higher commutant index

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the classification of binary shifts of finite commutant index.

We provide a complete classification up to conjugacy of the binary shifts of finite commutant index on the hyperfinite II(1), factor. There is a natural correspondence between the conjugacy classes of these shifts and polynomials over GF(2) satisfying a certain duality condition.

متن کامل

On the classification of binary shifts of minimal commutant index.

We provide a complete classification up to conjugacy of the binary shifts of commutant index 2 on the hyperfinite II(1) factor. There is a natural correspondence between the conjugacy classes of these shifts and polynomials over GF(2) satisfying a certain duality condition.

متن کامل

On the Higher Randić Index

Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i  v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih  v  v  v  over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...

متن کامل

Reflexive Polytopes of Higher Index

We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another ...

متن کامل

Identifying Higher-order Combinations of Binary Features

Finding statistically significant interactions between binary variables is computationally and statistically challenging in high-dimensional settings, due to the combinatorial explosion in the number of hypotheses. Terada et al. recently showed how to elegantly address this multiple testing problem by excluding non-testable hypotheses. Still, it remains unclear how their approach scales to larg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operators and Matrices

سال: 2012

ISSN: 1846-3886

DOI: 10.7153/oam-06-21